CEGAR Based Bounded Model Checking of Discrete Time Hybrid Systems
نویسندگان
چکیده
Many hybrid systems can be conveniently modeled as Piecewise Affine Discrete Time Hybrid Systems PA-DTHS. As well known Bounded Model Checking (BMC) for such systems comes down to solve a Mixed Integer Linear Programming (MILP) feasibility problem. We present a SAT based BMC algorithm for automatic verification of PA-DTHSs. Using Counterexample Guided Abstraction Refinement (CEGAR) our algorithm gradually transforms a PA-DTHS verification problem into larger and larger SAT problems. Our experimental results show that our approach can handle PADTHSs that are more then 50 times larger than those that can be handled using a MILP solver.
منابع مشابه
Hybridization Based CEGAR for Hybrid Automata with Affine Dynamics
We consider the problem of safety verification for hybrid systems, whose continuous dynamics in each mode is affine, Ẋ = AX + b, and invariants and guards are specified using rectangular constraints. We present a counter-example guided abstraction refinement framework (CEGAR), which abstract these hybrid automata into simpler ones with rectangular inclusion dynamics, ẋ ∈ I, where x is a variabl...
متن کاملCounterexample Guided Abstraction Refinement for Stability Analysis
In this paper, we present a counterexample guided abstraction refinement (Cegar) algorithm for stability analysis of polyhedral hybrid systems. Our results build upon a quantitative predicate abstraction and model-checking algorithm for stability analysis, which returns a counterexample indicating a potential reason for instability. The main contributions of this paper include the validation of...
متن کاملEngineering constraint solvers for automatic analysis of probabilistic hybrid automata
In this article, we recall different approaches to the constraint-based, symbolic analysis of hybrid discrete-continuous systems and combine them to a technology able to address hybrid systems exhibiting both non-deterministic and probabilistic behavior akin to infinite-state Markov decision processes. To enable mechanized analysis of such systems, we extend the reasoning power of arithmetic sa...
متن کاملAdmissibility analysis for discrete-time singular systems with time-varying delays by adopting the state-space Takagi-Sugeno fuzzy model
This paper is pertained with the problem of admissibility analysis of uncertain discrete-time nonlinear singular systems by adopting the state-space Takagi-Sugeno fuzzy model with time-delays and norm-bounded parameter uncertainties. Lyapunov Krasovskii functionals are constructed to obtain delay-dependent stability condition in terms of linear matrix inequalities, which is dependent on the low...
متن کاملModel Checking of Hybrid Systems Using Shallow Synchronization
Hybrid automata are a widely accepted modeling framework for systems with discrete and continuous variables. The traditional semantics of a network of automata is based on interleaving, and requires the construction of a monolithic hybrid automaton based on the composition of the automata. This destroys the structure of the network and results in a loss of efficiency, especially using bounded m...
متن کامل